Czech-Russian Homonymy as a Didactic Problem
نویسندگان
چکیده
منابع مشابه
Czech-to-Russian Transducing Dictionary
Malostransk~ m~m. 25 CS-118 O0 Prague I 0. A bottleneck of all produetional-oriented machine translation systems is to handle those words which are not included into main dictionaries of the particular system. In this paper we want to describe one possible approach to this problem, based on the idea of the so-called transduetlonal dictionary. The first part of the paper is devoted to the result...
متن کاملHomonymy and Polysemy in the Czech Morphological Dictionary
We focus on a problem of homonymy and polysemy in morphological dictionaries on the example of the Czech morphological dictionary MorfFlex CZ [2]. It is not necessary to distinguish meanings in morphological dictionaries unless the distinction has consequencies in word formation or syntax. The contribution proposes several important rules and principles for achieving consistency.
متن کاملTowards Parallel Czech-Russian Dependency Treebank
In this paper we describe initial steps in constructing a Czech-Russian dependency treebank and discuss the perspectives of its development. Following the experience of the Czech-English Parallel Treebank we have taken a syntactically annotated “gold standard” text for one language (Russian) and run an automatic annotation on the respective parallel text for the other language (Czech). Our tree...
متن کاملPortable Language Technology: Russian via Czech
We report on morphological tagging of Russian using very limited Russian resources. We train the TnT tagger (Brants, 2000) on a modified Czech corpus to get the transition probabilities. We believe that the two languages are similar enough for the transitional information to be useful. The Russian emission symbols are obtained using a morphological analyzer that does not rely on a manually crea...
متن کاملThe Russian cards problem : a
Suppose we have a stack of cards that is divided over some players. It may be possible to communicate your hand of cards to another player by public announcements, without yet another player learning any of your cards. A solution to this problem consists of some sequence of announcements and is called an exchange. It is called a direct exchange if it consists of (the minimum of) two announcemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: XLinguae
سال: 2015
ISSN: 1337-8384
DOI: 10.18355/xl.2015.08.01.57-67